A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
نویسندگان
چکیده
Abst rac t . The d-dimensional orthogonal knapsack problem (OKP) has a wide range of practical applications, including packing, cutting, and scheduling. We present a new approach to this problem, using a graphtheoretical characterization of feasible packings. This characterization allows us to deal with classes of packings that share a certain combinatorical structure, instead of single ones. Combining the use of this structure with other heuristics, we develop a two-level tree search algorithm for finding exact solutions for the d-dimensional OKP. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.
منابع مشابه
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surface into a number of rectangular pieces, each with a given size and value. The pieces must be cut with their edges always parallel or orthogonal to the edges of the master surface (orthogonal cuts). The objective is to ...
متن کاملA General New Algorithm for Regulaization of Singular Integrals in Three-Dimensional Boundary Elemnts
In this paper an algorithm is presented for the regularization of singular integrals with any degrees of singularity, which may be employed in all three-dimensional problems analyzed by Boundary Elements. The integrals in Boundary Integrals Equations are inherently singular. For example, one can mention the integrals confronted in potential problems to evaluate the flow or the gradient of the f...
متن کاملA General New Algorithm for Regulaization of Singular Integrals in Three-Dimensional Boundary Elemnts
In this paper an algorithm is presented for the regularization of singular integrals with any degrees of singularity, which may be employed in all three-dimensional problems analyzed by Boundary Elements. The integrals in Boundary Integrals Equations are inherently singular. For example, one can mention the integrals confronted in potential problems to evaluate the flow or the gradient of the f...
متن کاملApproximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کاملFORM FINDING FOR RECTILINEAR ORTHOGONAL BUILDINGS THROUGH CHARGED SYSTEM SEARCH ALGORITHM
Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...
متن کامل